SIMPLE algorithm

Results: 168



#Item
51Paxos Made Simple Leslie Lamport 01 Nov 2001 Abstract The Paxos algorithm, when presented in plain English, is very simple.

Paxos Made Simple Leslie Lamport 01 Nov 2001 Abstract The Paxos algorithm, when presented in plain English, is very simple.

Add to Reading List

Source URL: css.csail.mit.edu

Language: English - Date: 2014-12-08 14:33:01
524. Applications Meisters’ [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In fact Meisters suggests a greedy, but concise algorithm to achieve this goal, i.e., “find

4. Applications Meisters’ [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In fact Meisters suggests a greedy, but concise algorithm to achieve this goal, i.e., “find

Add to Reading List

Source URL: cgm.cs.mcgill.ca

Language: English - Date: 2002-06-13 17:58:05
    53A fast and simple algorithm for training neural probabilistic language models Andriy Mnih Gatsby Computational Neuroscience Unit, University College London

    A fast and simple algorithm for training neural probabilistic language models Andriy Mnih Gatsby Computational Neuroscience Unit, University College London

    Add to Reading List

    Source URL: www.cs.toronto.edu

    Language: English - Date: 2012-05-21 13:59:03
      54Linear Programming, the Simplex Algorithm and Simple Polytopes Gil Kalai Institute of Mathematics, Hebrew University of Jerusalem, Jerusalem, Israel e:mail: May 6, 1997

      Linear Programming, the Simplex Algorithm and Simple Polytopes Gil Kalai Institute of Mathematics, Hebrew University of Jerusalem, Jerusalem, Israel e:mail: May 6, 1997

      Add to Reading List

      Source URL: www.ma.huji.ac.il

      Language: English - Date: 2012-01-21 05:39:19
        55A Simple Algorithm for Computing a Spiral Polygonization of a Finite Planar Set M. Ahsan, S. Cheruvatur, M. Gamboni, A. Garg, O. Grishin, S. Hashimoto, J. Jermsurawong, G. T. Toussaint, and L. Zhang Faculty of Science, N

        A Simple Algorithm for Computing a Spiral Polygonization of a Finite Planar Set M. Ahsan, S. Cheruvatur, M. Gamboni, A. Garg, O. Grishin, S. Hashimoto, J. Jermsurawong, G. T. Toussaint, and L. Zhang Faculty of Science, N

        Add to Reading List

        Source URL: fwcg14.cse.uconn.edu

        Language: English - Date: 2014-10-29 21:34:14
          56Homework problem 0.1 What follows is (what I think is) a very simple algorithm in pseudocode, along with (what I think is) some poorly expressed mathematical explanation. Write it out in literate code, or whatever way yo

          Homework problem 0.1 What follows is (what I think is) a very simple algorithm in pseudocode, along with (what I think is) some poorly expressed mathematical explanation. Write it out in literate code, or whatever way yo

          Add to Reading List

          Source URL: studentnet.cs.manchester.ac.uk

          Language: English - Date: 2014-03-25 03:29:32
            57A fast and simple algorithm for training neural probabilistic language models Andriy Mnih & Yee Whye Teh Gatsby Computational Neuroscience Unit University College London Overview

            A fast and simple algorithm for training neural probabilistic language models Andriy Mnih & Yee Whye Teh Gatsby Computational Neuroscience Unit University College London Overview

            Add to Reading List

            Source URL: www.cs.toronto.edu

            Language: English - Date: 2012-06-21 17:05:05
              58A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration arXiv:1509.06231v1 [cs.NA] 21 Sep 2015

              A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration arXiv:1509.06231v1 [cs.NA] 21 Sep 2015

              Add to Reading List

              Source URL: arxiv.org

              Language: English - Date: 2015-09-21 20:50:04
                59A Simple and Practical Algorithm for Differentially Private Data Release Moritz Hardt IBM Almaden Research San Jose, CA

                A Simple and Practical Algorithm for Differentially Private Data Release Moritz Hardt IBM Almaden Research San Jose, CA

                Add to Reading List

                Source URL: papers.nips.cc

                Language: English - Date: 2014-04-23 13:25:44
                  60B 4. References 1 Bhattacharya B K, ElGindy H. A new linear convex hull algorithm for simple polygons. IEEE Transactions on Information

                  B 4. References 1 Bhattacharya B K, ElGindy H. A new linear convex hull algorithm for simple polygons. IEEE Transactions on Information

                  Add to Reading List

                  Source URL: cgm.cs.mcgill.ca

                  Language: English - Date: 2002-06-13 17:51:42